Identities Relating the Number of Partitions into an Even and Odd Number of Parts
نویسنده
چکیده
If / > 0 and n > 1, let qf (n) denote the number of partitions of/? into an even number of parts, where each part occurs at most / times and Set qf(n) denote the number of partitions of n into an odd number of parts, where each part occurs at most/times. \ii>0, \etqf(0)= 1 andqf(0) = 0. For/ >Oandn > 0, \v\Aj(n) = qJ(n)-q°(n). For/= 1, it is well known [1] that , A (n) = I ~ i f n = f ^ orsome j = 0, 1,2,-, 1 I 0 otherwise.
منابع مشابه
Partition Identities
A partition of a positive integer n (or a partition of weight n) is a non-decreasing sequence λ = (λ1, λ2, . . . , λk) of non-negative integers λi such that ∑k i=1 λi = n. The λi’s are the parts of the partition λ. Integer partitions are of particular interest in combinatorics, partly because many profound questions concerning integer partitions, solved and unsolved, are easily stated, but not ...
متن کاملBijections and Congruences for Generalizations of Partition Identities of Euler and Guy
In 1958, Richard Guy proved that the number of partitions of n into odd parts greater than one equals the number of partitions of n into distinct parts with no powers of 2 allowed, which is closely related to Euler’s famous theorem that the number of partitions of n into odd parts equals the number of partitions of n into distinct parts. We consider extensions of Guy’s result, which naturally l...
متن کاملNew Identities for the Polarized Partitions and Partitions with d-Distant Parts
In this paper we present a new class of integer partition identities. The number of partitions with d-distant parts can be written as a sum of the numbers of partitions of various lengths with 1-distant parts whose even parts, if there are any, are greater than twice the number of odd parts. We also provide a direct bijection between these classes of partitions. 1 Preliminaries and introduction...
متن کاملPartitions weighted by the parity of the crank
Abstract. A partition statistic ‘crank’ gives combinatorial interpretations for Ramanujan’s famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of partitions with even crank Me(n) minus the number of partitions with odd crank Mo(n) satisfies. For example, we show that Me(5n + 4)− Mo(5n + 4) ≡ 0 (mod...
متن کاملCore partitions into distinct parts and an analog of Euler's theorem
A special case of an elegant result due to Anderson proves that the number of (s, s + 1)-core partitions is finite and is given by the Catalan number Cs. Amdeberhan recently conjectured that the number of (s, s + 1)-core partitions into distinct parts equals the Fibonacci number Fs+1. We prove this conjecture by enumerating, more generally, (s, ds− 1)-core partitions into distinct parts. We do ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 15 شماره
صفحات -
تاریخ انتشار 1973